Fast Algorithm for Attributed Community Search
نویسندگان
چکیده
منابع مشابه
Effective Community Search for Large Attributed Graphs
Given a graph G and a vertex q ∈ G, the community search query returns a subgraph ofG that contains vertices related to q. Communities, which are prevalent in attributed graphs such as social networks and knowledge bases, can be used in emerging applications such as product advertisement and setting up of social events. In this paper, we investigate the attributed community query (or ACQ), whic...
متن کاملAdaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملSubspace Search for Community Detection and Community Outlier Mining in Attributed Graphs
Attributed graphs are widely used for the representation of social networks, gene and protein interactions, communication networks, or product co-purchase in web stores. Each object is represented by its relationships to other objects (edge structure) and its individual properties (node attributes). For instance, social networks store friendship relations as edges and age, income, and other pro...
متن کاملAn Algorithm For Fast Median Search
Searching for a median of a set of patterns is a well-known technique to model the set or to aid searching for more accurate models such as a generalized median or a k-median. While medians and generalized medians are (relatively) easy to compute in the case of Euclidean representation spaces, this is unfortunately no longer true when more complex distance measures are to be used, which often h...
متن کاملA Novel Algorithm for Fast Codebook Search
In this thesis, we propose an algorithm to reduce the complexity to search the most suitable codeword for a given codebook. It is proven in the thesis that about half codewords are eliminated in each iteration. In addition, we derive two lower bounds for the proposed algorithm and show that they reach the actual SNR loss in high resolution codebook. Furthermore, the complexity analysis and simu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information Processing
سال: 2021
ISSN: 1882-6652
DOI: 10.2197/ipsjjip.29.188